An FPT algorithm for the vertex cover P4 problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAn Effective Algorithm for Minimum Weighted Vertex Cover Problem
The Minimum Weighted Vertex Cover (MWVC) problem is a classic graph optimization NP complete problem. Given an undirected graph G = (V, E) and weighting function defined on the vertex set, the minimum weighted vertex cover problem is to find a vertex set S V whose total weight is minimum subject to every edge of G has at least one end point in S. In this paper an effective algorithm, called Sup...
متن کاملAn O∗(2O(k)) FPT Algorithm for the Undirected Feedback Vertex Set Problem∗
We describe an algorithm for the FEEDBACK VERTEX SET problem on undirected graphs, parameterized by the size k of the feedback vertex set, that runs in time O(ckn3) where c = 10.567 and n is the number of vertices in the graph. This improves on the best previous FPT algorithms due to [RSS02, KPS04] and [RS05] that have running times of the form O ∗(2O(k lg lg ) and O∗(2O(k lg k lg lg k ), respe...
متن کاملAn improved FPT algorithm for Independent Feedback Vertex Set
We study the Independent Feedback Vertex Set problem — a variant of the classic Feedback Vertex Set problem where, given a graph G and an integer k, the problem is to decide whether there exists a vertex set S ⊆ V (G) such that G \ S is a forest and S is an independent set of size at most k. We present an O∗((1 +φ))-time FPT algorithm for this problem, where φ < 1.619 is the golden ratio, impro...
متن کاملA Local 2-Approximation Algorithm for the Vertex Cover Problem
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆+ 1) synchronous communication rounds, where ∆ is the maximum degree of the graph. For ∆ = 3, we give a 2-approximation algorithm also for the weighted version of the problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.06.032